//https://leetcode.cn/problems/climbing-stairs/
package codeRandomThoughts.Test70爬楼梯;

/**
 * 动态规划
 */
public class Solution3 {
    public int climbStairs(int n) {
        if (n == 1) return 1;
        if (n == 2) return 2;

        return climbStairs(n - 1) + climbStairs(n - 2);
    }
}
